Fermat Numbers in the Pascal Triangle
نویسنده
چکیده
For any positive integer m let Fm = 2 2 + 1 be the mth Fermat number. In this short note we show that the only solutions of the diophantine equation Fm = ( n k ) are the trivial ones, i.e., those with k = 1 or n− 1.
منابع مشابه
The Weighted Fermat Triangle Problem
We completely solve the generalized Fermat problem: given a triangle P1, P2, P3 and three positive numbers λ1, λ2, λ3, find a point P for which the sum λ1P1P λ2P2P λ3P3P is minimal. We show that the point always exists and is unique, and indicate necessary and sufficient conditions for the point to lie inside the triangle. We provide geometric interpretations of the conditions and briefly indic...
متن کاملA Pascal-like Triangle Related to the Tribonacci Numbers
A tile composed of two pieces, which we refer to as a fence tile, is introduced to give the Tribonacci numbers a new combinatorial interpretation. The interpretation is used to construct a Pascal-like triangle and various identities concerning the triangle are proven. An intuitive proof of a general identity for the Tribonacci numbers in terms of sums of products of the binomial coefficients is...
متن کاملA Note on the Anticomplements of the Fermat Points
We show that each of the anticomplements of the Fermat points is common to a triad of circles involving the triangle of reflection. We also generate two new triangle centers as common points to two other triads of circles. Finally, we present several circles passing through these new centers and the anticomplements of the Fermat points.
متن کاملMotivation for Introducing q-Complex Numbers
We give a conceptual introduction to the q-umbral calculus of the author, a motivation for the q-complex numbers and a historical background to the development of formal computations, umbral calculus and calculus. The connection to trigonometry, prosthaphaeresis, logarithms and Cardan’s formula followed by the notational inventions by Viéte and Descartes is briefly described. One other keypoint...
متن کاملLarge primes in generalized Pascal triangles
In this paper, after presenting the results of the generalization of Pascal triangle (using powers of base numbers), we examine some properties of the 112-based triangle, most of all regarding to prime numbers. Additionally, an effective implementation of ECPP method is presented which enables Magma computer algebra system to prove the primality of numbers with more than 1000 decimal digits. 1 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003